SIAM J. SCI. COMPUT. Vol. 32, No. 6, pp. 3495–3523 c 2010 Society for Industrial and Applied Mathematics 

Source URL: www.cs.berkeley.edu

• Numerical linear algebra
• Cholesky decomposition
• LU decomposition
• Matrix multiplication
• Multiplication algorithm
• Gaussian elimination
• Parallel computing
• Matrix
• Time complexity
• Algebra
• Linear algebra
• Mathematics

Birds of Prey: Air Combat in the Jet Age Manufacturer: Ad Astra Cost: $59.95 Number of Players: 2 or more Complexity: Moderate Estimated Game Time: 1 hour and up

Source URL: 0191362.netsolhost.com

• Saganami Island Tactical Simulator
• Counter
• Birds of Prey
• Games
• Wargames
• Miniatures games

T HEORY OF C OMPUTING, Volume[removed]), pp. 179–195 http://theoryofcomputing.org Approximation Algorithms and Online Mechanisms for Item Pricing∗ Maria-Florina Balcan†

Source URL: www.cs.cmu.edu

• NP-complete problems
• Graph theory
• Approximation algorithm
• Hypergraph
• Time complexity
• Vertex cover
• Feedback arc set
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

T HEORY OF C OMPUTING, Volume[removed]), pp. 179–195 http://theoryofcomputing.org Approximation Algorithms and Online Mechanisms for Item Pricing∗ Maria-Florina Balcan†

Source URL: www.cs.cmu.edu

• NP-complete problems
• Graph theory
• Approximation algorithm
• Hypergraph
• Time complexity
• Vertex cover
• Feedback arc set
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Rome at War: Fading Legions ` Manufacturer: Avalanche Press Cost: $34.95 Number of Players: 2 or more Complexity: Moderate Estimated Game Time: 30 minutes to 3 hours

Source URL: 0191362.netsolhost.com

• Avalanche Press
• Gaming
• Recreation

Austerlitz 1805 Manufacturer: Avalanche Press Cost: $24.95 Number of Players: 2 Complexity: Beginner Estimated Game Time: 1 to 3 hours

Source URL: 0191362.netsolhost.com

Quick-Sort[removed]:1 Outline and Reading Š Quick-sort (§4.3)

Source URL: ww3.algorithmdesign.net

• Theoretical computer science
• Quicksort
• Algorithm
• Time complexity
• Selection algorithm
• Bucket sort
• Sorting algorithms
• Mathematics
• Order theory

Acta Univ. Sapientiae, Informatica, 5, [removed]–34 Efficient computing of n-dimensional simultaneous Diophantine approximation problems Attila KOVÁCS

Source URL: www.acta.sapientia.ro

• Continued fractions
• Convergent
• Transcendental number
• Equidistributed sequence
• Irrational number
• Rational number
• Time complexity
• Mathematics
• Mathematical analysis
• Diophantine approximation

Complexity Plots by Jeyarajan Thiyagalingam Simon Walton

Source URL: eprints.maths.ox.ac.uk

• Mathematics
• Computational complexity theory
• Statistical inference
• Estimation theory
• Time complexity
• Worst-case complexity
• Logarithm
• Complexity
• Estimator
• Theoretical computer science
• Applied mathematics
• Analysis of algorithms

Polymorphic Time Systems for Estimating Program Complexity Vincent Dornic  1 2 ; Pierre Jouvelot 1 3

Source URL: www.psrg.lcs.mit.edu

• Type theory
• Data types
• Theoretical computer science
• Lambda calculus
• Formal methods
• Type system
• Programming language
• Fixed-point combinator
• Recursive data type
• Software engineering
• Computing
• Programming language theory